Trees are almost prime

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On generalisations of almost prime and weakly prime ideals

Let $R$ be a commutative ring with identity‎. ‎A proper ideal $P$ of $R$ is a $(n-1,n)$-$Phi_m$-prime ($(n-1,n)$-weakly prime) ideal if $a_1,ldots,a_nin R$‎, ‎$a_1cdots a_nin Pbackslash P^m$ ($a_1cdots a_nin Pbackslash {0}$) implies $a_1cdots a_{i-1}a_{i+1}cdots a_nin P$‎, ‎for some $iin{1,ldots,n}$; ($m,ngeq 2$)‎. ‎In this paper several results concerning $(n-1,n)$-$Phi_m$-prime and $(n-1,n)$-...

متن کامل

Noncrossing trees are almost conditioned Galton-Watson trees

A non-crossing tree (NC-tree) is a tree drawn on the plane having as vertices a set of points on the boundary of a circle, and whose edges are straight line segments that do not cross. In this paper, we show that NC-trees with size n are conditioned Galton–Watson trees. As corollaries, we give the limit law of depth-first traversal processes and the limit profile of NC-trees.

متن کامل

on generalisations of almost prime and weakly prime ideals

let $r$ be a commutative ring with identity‎. ‎a proper ideal $p$ of $r$ is a $(n-1,n)$-$phi_m$-prime ($(n-1,n)$-weakly prime) ideal if $a_1,ldots,a_nin r$‎, ‎$a_1cdots a_nin pbackslash p^m$ ($a_1cdots a_nin pbackslash {0}$) implies $a_1cdots a_{i-1}a_{i+1}cdots a_nin p$‎, ‎for some $iin{1,ldots,n}$; ($m,ngeq 2$)‎. ‎in this paper several results concerning $(n-1,n)$-$phi_m$-prime and $(n-1,n)$-...

متن کامل

Sums of almost equal prime squares

In this short note, we prove that almost all integers N satisfying N ≡ 3 (mod 24) and 5 -N or N ≡ 4 (mod 24) is the sum of three or four almost equal prime squares, respectively: N = p21 + · · ·+ p 2 j with |pi − (N/j) 1/2| ≤ N1/2−9/80+ε for j = 3 or 4 and 1 ≤ i ≤ j.

متن کامل

Prime Chains and Pratt Trees

ABSTRACT. We study the distribution of prime chains, which are sequences p1, . . . , pk of primes for which pj+1 ≡ 1 (mod pj) for each j. We first give conditional upper bounds on the length of Cunningham chains, chains with pj+1 = 2pj+1 for each j. We give estimates for P (x), the number of chains with pk 6 x (k variable), and P (x; p), the number of chains with p1 = p and pk 6 px. The majorit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2007

ISSN: 0012-365X

DOI: 10.1016/j.disc.2005.11.083